A Formal Model of Software Pipelining Loops with Conditions
نویسندگان
چکیده
This paper addresses the problem of parallelizing loops with conditional branches in the context of software pipelining. A new formal approach to this problem is proposed in the form of Predicated Software Pipelining (PSP) model. The PSP model represents execution of a loop with conditional branches as transitions of a finite state machine. Each node of the state machine is composed of operations of one parallelized loop iteration. The rules for operation movements between nodes in the PSP model are described. The model represents a new theoretical framework for further investigation of inherent properties of these loops.
منابع مشابه
Equivalence Checking of Loops before and after Pipelining by Applying Symbolic Simulation and Induction
When applications contain large loops, high level synthesis often takes advantage of software pipelining technique in order to improve the performance. High level synthesis with pipelining utilization needs complicated algorithms. So it is desired to check its correctness. In this paper, we propose a novel approach for equivalence checking of loops before and after pipelining. The proposed appr...
متن کاملPredicated Software Pipelining Technique for Loops with Conditions
An effort to formalize the process of software pipelining loops with conditions is presented in this paper. A formal framework for scheduling such loops, based on representing sets of paths by matrices of predicates, has been proposed. Usual set operations and relationships may then be applied to such matrices. Operations of a loop body are placed into a single schedule with the flow of control...
متن کاملTime Optimal Software Pipelining of Loops with Control Flows for VLIW Processors
Software pipelining is widely used as a compiler optimization technique to achieve high performance in machines that exploit instruction-level parallelism such as superscalar or VLIW processors. However, surprisingly, there have been few theoretical results on the optimality of software pipelined loops with control flows. The problem of time optimal software pipelining of loops with control flo...
متن کاملA First Step Towards Time Optimal Software Pipelining of Loops with Control Flows
We address the problem of time optimal software pipelining of loops with control ows, one of the most di cult open problems in the area of parallelizing compilers. We present a necessary condition for loops with control ows to have equivalent time optimal programs, generalizing the result by Schwiegelshohn et al., which has been the most signi cant theoretical result on the problem. As part of ...
متن کاملSpatial Software Pipelining on Distributed Architectures for Sparse Matrix Codes
Wire delays and communication time are forcing processors to become decentralized modules communicating through a fast, scalable interconnect. For scalability, every portion of the processor must be decentralized, including the memory system. Compilers that can take a sequential program as input and parallelize it (including the memory) across the new processors are necessary. Much research has...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997